منابع مشابه
Solving Hard Disjunctive Logic Programs Faster (Sometimes)
Disjunctive Logic Programming (DLP) under the consistent answer set semantics is an advanced formalism for knowledge representation and reasoning. It is, under widely believed assumptions, strictly more expressive than normal (disjunction-free) logic programming, whose expressiveness is limited to properties decidable in NP. However, this higher expressiveness comes at a computational cost, and...
متن کاملLogic Programming Optimizations for Faster Model Checking
Over the last three years, we have showed that logic programming with tabulation can be used to construct eÆcient model checkers [RRR97, CDD98, DDR99]. In particular, we have developed XMC [RRS00], a model checker which veri es properties written in the alternation-free fragment of the modal mu-calculus [Koz83] for systems speci ed in XL, an extension of value-passing CCS [Mil89]. The XMC syste...
متن کاملFaster Logic Manipulation for Large Designs
When logic transformations, such as circuit restructuring, technology mapping, and post-mapping optimization, are repeatedly applied to large hardware designs, millions of relatively small (6-16 input) Boolean functions have to be efficiently manipulated. This paper focuses on a novel representation of these small functions, in terms of their disjoint-support decomposition (DSD) structures. A n...
متن کاملExtension of Logic regression to Longitudinal data: Transition Logic Regression
Logic regression is a generalized regression and classification method that is able to make Boolean combinations as new predictive variables from the original binary variables. Logic regression was introduced for case control or cohort study with independent observations. Although in various studies, correlated observations occur due to different reasons, logic regression have not been studi...
متن کاملFuzzy Algorithms: Applying Fuzzy Logic to the Golden Ratio Search to Find Solutions Faster
Applying the concept of fuzzy logic (an abstract version of Boolean logic) to well-known algorithms generates an abstract version (i.e., fuzzy algorithm) that often results in computational improvements. Precision may be reduced but counteracted by gaining computational efficiency. The trade-offs (e.g., small increase in space, loss of precision) for a variety of applications are deemed accepta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: III-Vs Review
سال: 2006
ISSN: 0961-1290
DOI: 10.1016/s0961-1290(06)71766-5